Divisible design digraphs and association schemes
نویسندگان
چکیده
Divisible design digraphs are constructed from skew balanced generalized weighing matrices and Hadamard matrices. Commutative non-commutative association schemes shown to be attached the divisible digraphs.
منابع مشابه
Normally Regular Digraphs, Association Schemes and Related Combinatorial Structures
This paper reports the characteristics of and mutual relationships between various combinatorial structures that give rise to certain imprimitive nonsymmetric three-class association schemes. Nontrivial relation graphs of an imprimitive symmetric 2-class association scheme are m ◦ Kr, (the union of m copies of the complete graph on r vertices) and its complement m ◦Kr, (the complete m-partite s...
متن کاملDivisible design graphs
A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a divisible design. Divisible design graphs are a natural generalization of (v, k, λ)-graphs, and like (v, k, λ)-graphs they make a link between combinatorial design theory and algebraic graph theory. The study of divisible design graphs benefits from, and contributes to, both parts. Using information of the e...
متن کاملTwo classes of q-ary codes based on group divisible association schemes
By means of Hall's Marriage Theorem, a class of q-ary codes are obtained through block designs based on group divisible association schemes with two associate classes. If these block designs are further semiframes, another class of q-ary codes are also constructed. @ 1999 Elsevier Science B.V. All rights reserved
متن کاملThe Basis Digraphs of p-schemes
It is proved that association schemes with bipartite basis graphs are exactly 2-schemes. This result follows from a characterization of p-schemes for an arbitrary prime p in terms of basis digraphs.
متن کاملWalk-regular divisible design graphs
A divisible design graph (DDG for short) is a graph whose adjacency matrix is the incidence matrix of a divisible design. DDGs were introduced by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs. It turns out that most (but not all) of the known examples of DDGs are walk-regular. In this paper we present an easy criterion for this to happen. In several cases ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2021
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2020.101763